Fast Scale Invariant Texture Synthesis with Gpu Acceleration
نویسندگان
چکیده
This paper presents a new algorithm for synthesising image texture. Texture synthesis is an important process in image post-production. Previous approaches can be classified as either parametric or nonparametric. Of these nonparametric approaches have achieved the most impressive results. Unfortunately, these methods generally suffer from high computational cost and difficulty in handling scale in the synthesis process. By introducing the wavelet decomposition as a basis for nonparametric texture synthesis, the advantages of nonparametric methods are combined with the computational efficiency and scale information readily available from the transform. The results show an order of magnitude improvement in computational speed and a better approximation of the dominant scale in the synthesised texture. The paper also presents a fast block searching algorithm using commodity graphics hardware. The computationally demanding neighbourhood search required by the Efros texture synthesis algorithm is implemented on the GPU. This results in an Efros texture synthesis algorithm which is up to 8 times faster than a similar C++ implementation.
منابع مشابه
Fast Implementation of Scale Invariant Feature Transform Based on CUDA
Scale-invariant feature transform (SIFT) was an algorithm in computer vision to detect and describe local features in images. Due to its excellent performance, SIFT was widely used in many applications, but the implementation of SIFT was complicated and time-consuming. To solve this problem, this paper presented a novel acceleration algorithm for SIFT implementation based on Compute Unified Dev...
متن کاملA GPU Based Memory Optimized Parallel Method For FFT Implementation
FFT (fast Fourier transform) plays a very important role in many fields, such as digital signal processing, digital image processing and so on. However, in application, FFT becomes a factor of affecting the processing efficiency, especially in remote sensing, which large amounts of data need to be processed with FFT. So shortening the FFT computation time is particularly important. GPU (Graphic...
متن کاملGPU-Based Multi-resolution Image Analysis for Synthesis of Tileable Textures
We propose a GPU-based algorithm for texture analysis and synthesis of nearly-regular patterns, in our case scanned textiles or similar manufactured surfaces. The method takes advantage of the highly parallel execution on the GPU to generate correlation maps from captured template images. In an analysis step a lattice encoding the periodicity of the texture is computed. This lattice is used to ...
متن کاملA real-time GPU implementation of the SIFT algorithm for large-scale video analysis tasks
The SIFT algorithm is one of the most popular feature extraction methods and therefore widely used in all sort of video analysis tasks like instance search and duplicate/ near-duplicate detection. We present an efficient GPU implementation of the SIFT descriptor extraction algorithm using CUDA. The major steps of the algorithm are presented and for each step we describe how to efficiently paral...
متن کاملFast Features Invariant to Rotation and Scale of Texture
A family of novel texture representations called Ffirst, the Fast Features Invariant to Rotation and Scale of Texture, is introduced. New rotation invariants are proposed, extending the LBP-HF features, improving the recognition accuracy. Using the full set of LBP features, as opposed to uniform only, leads to further improvement. Linear Support Vector Machines with an approximate χ-kernel map ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005